Efficient Tests under a Weak Convergence Assumption
نویسندگان
چکیده
منابع مشابه
Efficient Tests under a Weak Convergence Assumption∗
The asymptotic validity of tests is usually established by making appropriate primitive assumptions, which imply the weak convergence of a specific function of the data, and an appeal to the continuous mapping theorem. This paper, instead, takes the weak convergence of some function of the data to a limiting random element as the starting point, and studies efficiency in the class of tests that...
متن کاملLinear Convergence of the Randomized Feasible Descent Method Under the Weak Strong Convexity Assumption
In this paper we generalize the framework of the feasible descent method (FDM) to a randomized (R-FDM) and a coordinate-wise random feasible descent method (RC-FDM) framework. We show that the famous SDCA algorithm for optimizing the SVM dual problem, or the stochastic coordinate descent method for the LASSO problem, fits into the framework of RC-FDM. We prove linear convergence for both R-FDM ...
متن کاملLinear Convergence of Randomized Feasible Descent Methods Under the Weak Strong Convexity Assumption
In this paper we generalize the framework of the Feasible Descent Method (FDM) to a Randomized (R-FDM) and a Randomized Coordinate-wise Feasible Descent Method (RCFDM) framework. We show that many machine learning algorithms, including the famous SDCA algorithm for optimizing the SVM dual problem, or the stochastic coordinate descent method for the LASSO problem, fits into the framework of RC-F...
متن کاملConsistent Detection of Global Predicates under a Weak Fault Assumption
We study the problem of detecting general global predicates in distributed systems where all application processes and at most t < m monitor processes may be subject to crash faults, where m is the total number of monitor processes in the system. We introduce two new observation modalities called negotiably and discernibly (which correspond to possibly and definitely in fault-free systems) and ...
متن کاملThe Opacity of Backbones and Backdoors Under a Weak Assumption
Backdoors and backbones of Boolean formulas are hidden structural properties that are relevant to the analysis of the hardness of instances of the satisfiability problem, SAT. The development and analysis of algorithms to find and make use of these properties is thus useful to improve the performance of modern solvers and our general understanding of SAT. In this paper we show that, under the a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2008
ISSN: 1556-5068
DOI: 10.2139/ssrn.1105731